Perfect Graphs with No 2k 2 and No K 6
نویسنده
چکیده
We prove that a 2K 2 minimal imperfect Berge graph (if any) contains a K 6 : A graph is perfect if the vertices of any induced subgraph H can be colored, in such a way that no two adjacent vertices receive the same color, with a number of colors (denoted by (H)) not exceeding the cardinality !(H) of a maximum clique of H. A graph is minimal imperfect if all its proper induced subgraphs are perfect but it is not. It is an easy task to check that an odd chordless cycle of length at least ve (usually called a hole), as well as its complement (usually called an anti-hole) are minimal imperfect graphs. This remark and some early results concerning perfect graphs determined Berge 1] to formulate the two following conjectures (known as the Strong and the Weak Perfect Graph Conjecture) (SPGC) A graph is perfect if and only if it does not contain an odd hole or an odd anti-hole as an induced subgraph.
منابع مشابه
Connectivity of k-extendable graphs with large k
Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer k (06 k6 n − 1), G is k-extendable if any matching of size k in G is contained in a perfect matching of G. It is proved that if G is a k-extendable graph on 2n vertices with k¿ n=2, then either G is bipartite or the connectivity of G is at least 2k. As a corollary, we show that if G is a maximal...
متن کاملOn the index of bicyclic graphs with perfect matchings
Let B(2k) be the set of all bicyclic graphs on 2k(k¿ 2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with maximal index in B(2k). c © 2004 Elsevier B.V. All rights reserved. MSC: 05c50
متن کاملTHE MAXIMUM NUMBER OF EDGES IN x*-FREE GRAPHS OF BOUNDED DEGREE
We call a graph 2K,-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G)co(G)[o(G)+ 1]/2 if G is 2K,-free where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2Kz-free graphs ha...
متن کاملEla on the Distance Spectral Radius of Unicyclic Graphs with Perfect Matchings
Abstract. For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. Let U1 2k be the graph obtained from C3 by attaching a path of length n− 3 at one vertex. Let U2 2k be the graph obtained from C3 by attaching a pendant edge together with k − 2 paths of length 2 at the same vertex. In this paper, it is proved that U1 2k (resp., U 2 2k) is the unique ...
متن کاملSlightly triangulated graphs are perfect
A graph is triangulated if it has no chordless cycle with at least four vertices (8k 4; C k 6 6 G). These graphs have been generalized by R. Hayward with the weakly triangulated graphs (8k 5; C k ; C k 6 6 G). In this note we propose a new generalization of triangulated graphs. A graph G is slightly triangulated if it satisses the two following conditions : 1. G contains no chordless cycle with...
متن کامل